Some structural properties of low rank matrices related

نویسنده

  • Giovanni Resta
چکیده

We consider the problem of the presence of short cycles in the graphs of nonzero elements of matrices which have sublinear rank and nonzero entries on the main diagonal, and analyze the connection of these properties to the rigidity of matrices. In particular, we exhibit a family of matrices which shows that sublinear rank does not imply the existence of triangles. This family can also be used to give a constructive bound of the order of k 3=2 on the Ramsey number R(3; k), which matches the best known bound. On the other hand we prove that sublinear rank implies the existence of 4-cycles. We prove some partial results towards establishing lower bounds on matrix rigidity and consequently on the size of logarithmic depth circuits for computing certain explicit linear transformations.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Some rank equalities for finitely many tripotent matrices

‎A rank equality is established for the sum of finitely many tripotent matrices via elementary block matrix operations‎. ‎Moreover‎, ‎by using this equality and Theorems 8 and 10 in [Chen M‎. ‎and et al‎. ‎On the open problem related to rank equalities for the sum of finitely many idempotent matrices and its applications‎, ‎The Scientific World Journal 2014 (2014)‎, ‎Article ID 702413‎, ‎7 page...

متن کامل

On higher rank numerical hulls of normal matrices

‎In this paper‎, ‎some algebraic and geometrical properties of the rank$-k$ numerical hulls of normal matrices are investigated‎. ‎A characterization of normal matrices whose rank$-1$ numerical hulls are equal to their numerical range is given‎. ‎Moreover‎, ‎using the extreme points of the numerical range‎, ‎the higher rank numerical hulls of matrices of the form $A_1 oplus i A_2$‎, ‎where $A_1...

متن کامل

Revision 01 of Some Structural Properties of Low Rank Matrices Related to Computational Complexity

We consider the problem of the presence of short cycles in the graphs of nonzero elements of matrices which have sublinear rank and nonzero entries on the main diagonal, and analyze the connection between these properties and the rigidity of matrices. In particular, we exhibit a family of matrices which shows that sublinear rank does not imply the existence of triangles. This family can also be...

متن کامل

Some structural properties of low-rank matrices related to computational complexity

We consider the conjecture stating that a matrix with rank o(n) and ones on the main diagonal must contain nonzero entries on a 2 2 submatrix with one entry on the main diagonal. We show that a slightly stronger conjecture implies that an explicit linear transformation cannot be computed by linear size and logarithmic depth circuits. We prove some partial results supporting the conjecture.

متن کامل

On p-semilinear transformations

In this paper, we introduce $p$-semilinear transformations for linear algebras over a field ${bf F}$ of positive characteristic $p$, discuss initially the elementary properties of $p$-semilinear transformations, make use of it to give some characterizations of linear algebras over a field ${bf F}$ of positive characteristic $p$. Moreover, we find a one-to-one correspondence between $p$-semiline...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998